Bounded Randomness
نویسندگان
چکیده
We introduce some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore how these randomness notions relate to classical randomness notions and to degrees of unsolvability.
منابع مشابه
Resource bounded randomness and computational complexity
The following is a survey of resource bounded randomness concepts and their relations to each other. Further, we introduce several new resource bounded randomness concepts corresponding to the classical randomness concepts, and show that the notion of polynomial time bounded Ko randomness is independent of the notions of polynomial time bounded Lutz, Schnorr and Kurtz randomness. Lutz has conje...
متن کاملLowness for Bounded Randomness Rod Downey and Keng
In [3], Brodhead, Downey and Ng introduced some new variations of the notions of being Martin-Löf random where the tests are all clopen sets. We explore the lowness notions associated with these randomness notions. While these bounded notions seem far from classical notions with infinite tests like Martin-Löf and Demuth randomness, the lowness notions associated with bounded randomness turn out...
متن کاملResource-Bounded Measure and Randomness
Supported by the Human Capital and Mobility Program of the European Community under grant CHRX-CT93-0415 (COLORET). Mathematisches Institut, Universit at Heidelberg, D-69120 Heidelberg, Germany Universidad de Zaragoza, Dept. Inform atica, CPS, Mar a del Luna 3, E-50015 Zaragoza, Spain We survey recent results on resource-bounded measure and randomness in structural complexity theory. In partic...
متن کاملResource-Bounded Randomness and Compressibility with Respect to Nonuniform Measures
Most research on resource-bounded measure and randomness has focused on the uniform probability density, or Lebesgue measure, on {0, 1}∞; the study of resource-bounded measure theory with respect to a nonuniform underlying measure was recently initiated by Breutzmann and Lutz [1]. In this paper we prove a series of fundamental results on the role of nonuniform measures in resource-bounded measu...
متن کاملClosure of Resource-Bounded Randomness Notions Under Polynomial-Time Permutations
An infinite bit sequence is called recursively random if no computable strategy betting along the sequence has unbounded capital. It is wellknown that the property of recursive randomness is closed under computable permutations. We investigate analogous statements for randomness notions defined by betting strategies that are computable within resource bounds. Suppose that S is a polynomial time...
متن کاملOn Resource-Bounded Versions of the van Lambalgen Theorem
The van Lambalgen theorem is a surprising result in algorithmic information theory concerning the symmetry of relative randomness. It establishes that for any pair of infinite sequences A and B, B is Martin-Löf random and A is Martin-Löf random relative to B if and only if the interleaved sequence A ⊎ B is Martin-Löf random. This implies that A is relative random to B if and only if B is random...
متن کامل